Covering t-element Sets by Partitions
نویسندگان
چکیده
منابع مشابه
On Sets Represented by Partitions
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts) partitions of an integer n.
متن کاملCovering-based Rough sets Based on the Refinement of Covering-element
Covering-based rough sets is an extension of rough sets and it is based on a covering instead of a partition of the universe. Therefore it is more powerful in describing some practical problems than rough sets. However, by extending the rough sets, covering-based rough sets can increase the roughness of each model in recognizing objects. How to obtain better approximations from the models of a ...
متن کاملDistances Realized by Sets Covering the Plane
A proof is given of the (known) result that, if real n-dimensional Euclidean space R” is covered by any n + 1 sets, then at least one of these sets is such that each distance d (0 < d < a)) is realized as the distance between two points of the set. In particular, this result holds if the plane is covered by three sets; but it does not necessarily hold if the plane is covered by six sets. I f ea...
متن کاملCovering Pareto Sets by Multilevel Subdivision Techniques
In this work we present a new set oriented numerical method for the numerical solution of multi-objective optimization problems. These methods are global in nature and allow to approximate the entire set of (global) Pareto points. After proving convergence of an associated abstract subdivision procedure we use this result as a basis for the development of three different algorithms. We also con...
متن کاملOn Visibility and Covering by Convex Sets
A set X IR d is n-convex if among any n its points there exist two such that the segment connecting them is contained in X. Perles and Shelah have shown that any closed (n + 1)-convex set in the plane is the union of at most n 6 convex sets. We improve their bound to 18n 3 , and show a lower bound of order (n 2). We also show that if X IR 2 is an n-convex set such that its complement has one-po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1991
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(13)80099-6